- indexing techniques
- pl.методы индексации
Англо-русский словарь промышленной и научной лексики. 2014.
indexing techniques
Смотреть что такое "indexing techniques" в других словарях:
Term indexing — In computer science, term indexing is the task of creating an index of terms and clauses in a collection.Many operations in automatic theorem provers require search in huge collections of terms and clauses. Such operations typically fall intothe… … Wikipedia
Enhanced indexing — In finance, enhanced indexing is a catch all term that describes strategies employed to outperform traditional indexing. Enhanced indexing attempts to generate modest excess returns compared to index funds and other passive management… … Wikipedia
IEEE Transactions on Microwave Theory and Techniques — Former name(s) … Wikipedia
Fuzzy string searching — Approximate string search is the name that is used for a category of techniques for finding strings that approximately match some given pattern string. It may also be known as approximate or inexact matching. Approximate string searching has two… … Wikipedia
Relational database — A visual diagram showing the relationship between the two tables, as indicated by the arrow A relational database matches data by using common characteristics found within the data set. The resulting groups of data uses the relational model (a… … Wikipedia
Lookup table — In computer science, a lookup table is a data structure, usually an array or associative array, often used to replace a runtime computation with a simpler array indexing operation. The savings in terms of processing time can be significant, since … Wikipedia
Lowest common ancestor — This article is about lowest common ancestors in graph theory and computer science. For the common ancestor of a set of species in evolutionary trees, see most recent common ancestor. For a common ancestor of all life forms, see last universal… … Wikipedia
Vampire theorem prover — Vampire is an automatic theorem prover for first order classical logic developed in the Computer Science Department of the University of Manchester by Prof. Andrei Voronkov previously together with Dr. Alexandre Riazanov. It has won the world cup … Wikipedia
Bounding interval hierarchy — A bounding interval hierarchy (BIH) is a partitioning data structure similar to that of bounding volume hierarchies or kd trees. Bounding interval hierarchies can be used in high performance (or real time) ray tracing and may be especially useful … Wikipedia
Thomas of Ireland — (fl. 1295 died before 1338), known as Thomas Hibernicus, not to be confused with the Franciscan friar Thomas de Hibernia (d. c. 1270),[1] was an Irish writer. His claim to fame is not as an original author, but as an anthologist and indexer.… … Wikipedia
information processing — Acquisition, recording, organization, retrieval, display, and dissemination of information. Today the term usually refers to computer based operations. Information processing consists of locating and capturing information, using software to… … Universalium
